GLR-parsing of word lattices using a beam search method
نویسنده
چکیده
The process of understanding spoken language re quires the e cient processing of ambiguities that arise by the nature of speech This paper presents an ap proach that allows the e cient incremental integra tion of speech recognition and language understand ing using Tomita s generalized LR parsing algorithm For this purpose the GLR lattice parsing algorithm is revised so that an agenda mechanism can be used to control the ow of computation of the parsing process Subsequently the HMM evaluations of the word models are combined with a stochastical lan guage model to do a beam search similar to where chartparsers are used to do the job
منابع مشابه
Glr* : a Robust Parser for Spontaneously Spoken Language
This paper describes GLR*, a parsing system based on Tomita's Generalized LR parsing algorithm, that was designed to be robust to two particular types of extra-grammaticality: noise in the input, and limited grammar coverage. GLR* attempts to overcome these forms of extra-grammaticality by ignoring the unparsable words and fragments and conducting a search for the maximal subset of the original...
متن کاملGLR* : A Robust Grammar-Focused Parser for Spontaneously Spoken Language
The analysis of spoken language is widely considered to be a more challenging task than the analysis of written text. All of the difficulties of written language can generally be found in spoken language as well. Parsing spontaneous speech must, however, also deal with problems such as speech disfluencies, the looser notion of grammaticality, and the lack of clearly marked sentence boundaries. ...
متن کاملBi-directional LR Parsing from an Anchor Word for Speech Recognition
This paper introduces a new technique of parsing sentences from an arbitrary word which is highly reliable or semantically important. This technique adopts an efficient LR parsing method and uses a reverse LR table constructed besides a standard LR table. This technique is particularly suitable in parsing a lattice of words hypothesized by a speech recognition module. If we choose anchor symbol...
متن کاملProbabilistic Language Modeling for Generalized Lr Parsing
Preface In this thesis, we introduce probabilistic models to rank the likelihood of resultant parses within the GLR parsing framework. Probabilistic models can also bring about the beneet of reduction of search space, if the models allow preex probabilities for partial parses. In devising the models, we carefully observe the nature of GLR parsing, one of the most eecient parsing algorithms in e...
متن کاملGlr* - an Eecient Noise-skipping Parsing Algorithm for Context Free Grammars
This paper describes GLR*, a parser that can parse any input sentence by ignoring unrecog-nizable parts of the sentence. In case the standard parsing procedure fails to parse an input sentence, the parser nondeterministically skips some word(s) in the sentence, and returns the parse with fewest skipped words. Therefore, the parser will return some parse(s) with any input sentence, unless no par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cmp-lg/9506020 شماره
صفحات -
تاریخ انتشار 1995